منابع مشابه
Dilatonic Parallelizable NS-NS Backgrounds
We complete the classification of parallelizable NS-NS backgrounds in type II super-gravity by adding the dilatonic case to the result of Figueroa-O'Farrill on the non-dilatonic case. We also study the supersymmetry of these parallelizable backgrounds. It is shown that all the dilatonic parallelizable backgrounds have sixteen supersymmetries. The parallelizable pp-wave backgrounds have been rec...
متن کاملBranes on Charged Dilatonic Backgrounds: Self-Tuning, Lorentz Violations and Cosmology
We study the motion of an n-brane in an n + q + 2 dimensional background that has dilatonic q-brane singularities and that is charged under an antisymmetric tensor field. The background spacetime is maximally symmetric in the n-dimensions parallel to the n-brane with constant curvature k = 0,±1. For k = 1 the bulk solutions correspond to black q-branes. For k = 0,−1 the geometry resembles the ‘...
متن کاملCurved dilatonic brane worlds
We construct a broad family of exact solutions to the five-dimensional Einstein equations coupled to a scalar field with an exponential potential. Embedding a three-brane in these bulk space-times in a particular way we obtain a class of self-tuned curved brane worlds in which the vacuum energy on the brane is gravitationally idle, the four-dimensional geometry being insensitive to the value of...
متن کاملString Theory on Parallelizable PP-Waves
The most general parallelizable pp-wave backgrounds which are non-dilatonic solutions in the NS-NS sector of type IIA and IIB string theories are considered. We demonstrate that parallelizable pp-wave backgrounds are necessarily homogeneous plane-waves, and that a large class of homogeneous plane-waves are parallelizable, stating the necessary conditions. Such plane-waves can be classified acco...
متن کاملHighly Parallelizable Problems
of Results. We establish that several problems are highly parallelizable. For each of these problems, we design an optimal O (loglogn ) time parallel algorithm on the Common CRCW PRAM model which is the weakest among the CRCW PRAM models. These problems include: g all nearest smaller values, g preprocessing for answering range maxima queries, g several problems in Computational Geometry, g stri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Letters B
سال: 2003
ISSN: 0370-2693
DOI: 10.1016/j.physletb.2003.06.022